A Practical Way for Computing Approximate Lower and Upper Correlation Bounds

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Practical Way for Computing Approximate Lower and Upper Correlation Bounds

Correlations among variables are typically not free to vary between −1 and 1, with bounds determined by the marginal distributions. Computing upper and lower limits of correlations given the marginal characteristics often raises theoretical and computational challenges. We propose a simple sorting technique that is predicated upon a little-known consequence of a well-established fact from stati...

متن کامل

Correlation lower bounds from correlation upper bounds

We show that for any coprime m, r there is a circuit of the form MODm ◦ ANDd(n) whose correlation with MODr is at least 2 −O( n d(n) ). This is the first correlation lower bound for arbitrary m, r, whereas previously lower bounds were known for prime m. Our motivation is the question posed by Green et al. [11] to which the 2( n d(n) ) bound is a partial negative answer. We first show a 2−Ω(n) c...

متن کامل

Upper and lower bounds for numerical radii of block shifts

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

متن کامل

Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths

We consider the problems of constructing geometric spanners, possibly containing Steiner points, for sets of points in the d-dimensional space IR d , and constructing spanners and approximate shortest paths among a collection of polygonal obstacles in the plane. The complexities of these problems are shown to be (n log n) in the algebraic computation tree model. Since O(n log n)-time algorithms...

متن کامل

Upper and lower bounds of symmetric division deg index

Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The American Statistician

سال: 2011

ISSN: 0003-1305,1537-2731

DOI: 10.1198/tast.2011.10090